Source-Channel Coding Under Energy, Delay, and Buffer Constraints
نویسندگان
چکیده
منابع مشابه
Joint and tandem source-channel coding with delay constraints
Two common source-channel coding strategies, joint and tandem, are compared on the basis of distortion vs. delay by analyzing specific representatives of each when transmitting analog data samples across a binary symmetric channel. Channel-optimized transform coding is the joint sourcechannel coding strategy; transform coding with Reed-Solomon coding is the tandem strategy. For each strategy, f...
متن کاملError Exponents for Joint Source-Channel Coding with Delay-Constraints
Traditionally, joint source-channel coding is viewed in the block coding context — all the source symbols are known in advance by the encoder. Here, we consider source symbols to be revealed to the encoder in real time and require that they be reconstructed at the decoder within a certain fixed end-to-end delay. We derive upper and lower bounds on the reliability function with delay for cases w...
متن کاملOptimal Shape Coding under Buffer Constraints
In this paper, we consider an optimal rate control algorithm for shape coding of emerging MPEG-4 compression system. Current MPEG-4 shape coding consists of two sub-steps; First distortion is introduced by scaling down and up way. Then, second, context-based arithmetic coding is applied. Since the arithmetic coding is \lossless", scaling down and up step is considered as a virtual quantizer. We...
متن کاملSource coding under security constraints
Information theoretic security characterizes the fundamental limitations of unconditional security against computationally unbounded adversaries. In this chapter, secure distributed compression in the presence of eavesdropper(s) is considered from the information theoretic security perspective. Basic models and fundamental results are summarized for lossless and lossy source compression. Distri...
متن کاملUniversal Zero-Delay Joint Source-Channel Coding
We consider zero-delay joint source-channel coding of individual source sequences for a general known channel. Given an arbitrary finite set of schemes with finite-memory (not necessarily time-invariant) decoders, a scheme is devised that does essentially as well as the best in the set on all individual source sequences. Using this scheme, we construct a universal zero-delay joint source-channe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Wireless Communications
سال: 2015
ISSN: 1536-1276
DOI: 10.1109/twc.2015.2413417